Explication as a Three-Step Procedure: the case of the Church-Turing Thesis
نویسندگان
چکیده
منابع مشابه
The Church-Turing Thesis
cell containing a left end marker ` (never written over) and extends to infinitely many cells to the right. This machine has a head that can move left or right one cell in each step, and in each step it reads the current symbol it is currently scanning and overwrites it before moving on. Initally, the tape contains the input string, which is finite, on cells numbered 1 onwards (cell 0 contains ...
متن کاملComputationalism, The Church-Turing Thesis, and the Church-Turing Fallacy
The Church–Turing Thesis (CTT) is often employed in arguments for computationalism. I scrutinize the most prominent of such arguments in light of recent work on CTT and argue that they are unsound. Although CTT does nothing to support computationalism, it is not irrelevant to it. By eliminating misunderstandings about the relationship between CTT and computationalism, we deepen our appreciation...
متن کاملOn the Church-Turing Thesis
After a brief description of the Church-Turing Thesis, we suggest that, according to the latest results on classical recursive probabilistic solution of the Halting Problem, such thesis is asymptotically false.
متن کاملA Formalization of the Church-Turing Thesis
Our goal is to formalize the Church-Turing Thesis for a very large class of computational models. Specifically, the notion of an “effective model of computation” over an arbitrary countable domain is axiomatized. This is accomplished by modifying Gurevich’s “Abstract State Machine” postulates for state-transition models. A proof is provided that all models satisfying these axioms, regardless of...
متن کاملThe Church-Turing thesis as a guiding principle for physics
Two aspects of the physical side of the Church-Turing thesis are discussed. The first issue is a variant of the Eleatic argument against motion, dealing with Zeno squeezed time cycles of computers. The second argument reviews the issue of one-to-one computation, that is, the bijective (unique and reversible) evolution of computations and its relation to the measurement process.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal for Philosophy of Science
سال: 2021
ISSN: 1879-4912,1879-4920
DOI: 10.1007/s13194-020-00337-2